Runtime analysis of the (1 + 1) EA on computing unique input output sequences
نویسندگان
چکیده
Article history: Received 11 March 2008 Received in revised form 10 November 2008 Accepted 30 January 2010 Available online xxxx
منابع مشابه
Runtime Analysis of (1+1) EA on Computing Unique Input Output Sequences
Computing unique input output (UIO) sequences is a fundamental and hard problem in conformance testing of finite state machines (FSM). Previous experimental research has shown that evolutionary algorithms (EAs) can be applied successfully to find UIOs on some instances. However, before EAs can be recommended as a practical technique for computing UIOs, it is necessary to better understand the p...
متن کاملCrossover Can Be Constructive When Computing Unique Input Output Sequences
Unique input output (UIO) sequences have important applications in conformance testing of finite state machines (FSMs). Previous experimental and theoretical research has shown that evolutionary algorithms (EAs) can compute UIOs efficiently on many FSM instance classes, but fail on others. However, it has been unclear how and to what degree EA parameter settings influence the runtime on the UIO...
متن کاملDesign and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods
Occasionally there have been long debates on whether to use elitist selection or not. In the present paper the simple (1,λ) EA and (1+λ) EA operating on {0, 1}n are compared by means of a rigorous runtime analysis. It turns out that only values for λ that are logarithmic in n are interesting. An illustrative function is presented for which newly developed proof methods show that the (1,λ) EA—wh...
متن کاملRuntime Analysis of the (mu + 1) EA on Simple Pseudo-Boolean Functions
Although Evolutionary Algorithms (EAs) have been successfully applied to optimization in discrete search spaces, theoretical developments remain weak, in particular for population-based EAs. This paper presents a first rigorous analysis of the (mu+1) EA on pseudo-Boolean functions. Using three well-known example functions from the analysis of the (1+1) EA, we derive bounds on the expected runti...
متن کاملMinimizing the Weights dispersion in Cross-Efficiency Measurement in data envelopment analysis
Because of the piecewise linear nature of the data envelopment analysis (DEA) frontier, the optimal multipliers of the DEA models may not be unique. Choosing weights from alternative optimal solutions of dual multiplier models is one of the most frequently studied subjects in the context of DEA. In this paper, the authors have been inspired by the idea of Cooper et al. (2011) to propose a li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Sci.
دوره 259 شماره
صفحات -
تاریخ انتشار 2014